منابع مشابه
The disjunction property implies the numerical existence property.
Any recursively enumerable extension of intuitionistic arithmetic which obeys the disjunction property obeys the numerical existence property. Any recursively enumerable extension of intuitionistic arithmetic proves its own disjunction property if and only if it proves its own inconsistency.
متن کاملPolynomial space hardness without disjunction property
In [HT11], Horč́ık and Terui show that if a substructural logic enjoys the disjunction property, then its tautology problem is PSPACE-hard. We prove that all substructural logics in the interval between intuitionistic logic and generalized Hájek basic logic have a PSPACE-hard tautology problem, which implies that uncountably many substructural logics lacking the disjunction property have a PSPAC...
متن کاملDisjunction property and complexity of substructural logics
We systematically identify a large class of substructural logics that satisfy the disjunction property (DP), and show that every consistent substructural logic with the DP is PSPACE-hard. Our results are obtained by using algebraic techniques. PSPACE-completeness for many of these logics is furthermore established by proof theoretic arguments.
متن کاملA polynomial time complete disjunction property in intuitionistic propositional logic
We extend the polynomial time algorithms due to Buss and Mints[2] and Ferrari, Fiorentini and Fiorino[4] to yield a polynomial time complete disjunction property in intuitionistic propositional logic. The disjunction property, DP of the intuitionistic propositional logic Ip says that if a disjunction α0 ∨ α1 is derivable intuitionistically, then so is αi for an i. This property follows from cut...
متن کاملFeasible Disjunction Property and Feasible Interpolation in Modal Logic
We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2016
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-016-9704-x